AN INEXACT PROXIMAL POINT ALGORITHM FOR NONMONOTONE EQUILIBRIUM PROBLEMS IN BANACH SPACES
نویسندگان
چکیده
منابع مشابه
An Inexact Proximal Point Algorithm for Nonmonotone Equilibrium Problems in Banach Spaces
In this paper, we continue to investigate the inexact hybrid proximal point algorithm proposed by Mashreghi and Nasri for equilibrium problems in Banach spaces. Under some classes of generalized monotone conditions, we prove that the sequence generated by the method is strongly convergent to a solution of the problem, which is closest to the initial iterate, in the sense of Bregman distance. As...
متن کاملA Hybrid Proximal Point Algorithm for Resolvent operator in Banach Spaces
Equilibrium problems have many uses in optimization theory and convex analysis and which is why different methods are presented for solving equilibrium problems in different spaces, such as Hilbert spaces and Banach spaces. The purpose of this paper is to provide a method for obtaining a solution to the equilibrium problem in Banach spaces. In fact, we consider a hybrid proximal point algorithm...
متن کاملRegularization Inertial Proximal Point Algorithm for Convex Feasibility Problems in Banach Spaces
Abstract The purpose of this paper is to give a regularization variant of the inertial proximal point algorithm not only in an infinite-dimensional Banach space E, which is an uniformly smooth and uniformly convex, but also in its finite-dimensional approximations for finding a point in the nonempty intersection ∩i=1Ci, where N ≥ 1 is an integer and each Ci is assumed to be the fixed point set ...
متن کاملAn inexact and nonmonotone proximal method for smooth unconstrained minimization
An implementable proximal point algorithm is established for the smooth nonconvex unconstrained minimization problem. At each iteration, the algorithm minimizes approximately a general quadratic by a truncated strategy with step length control. The main contributions are: (i) a framework for updating the proximal parameter; (ii) inexact criteria for approximately solving the subproblems; (iii) ...
متن کاملAn Accelerated Inexact Proximal Point Algorithm for Convex Minimization
The proximal point algorithm (PPA) is classical and popular in the community of Optimization. In practice, inexact PPAs which solves the involved proximal subproblems approximately subject to certain inexact criteria are truly implementable. In this paper, we first propose an inexact PPA with a new inexact criterion for solving convex minimization, and show that the iteration-complexity of this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Taiwanese Journal of Mathematics
سال: 2013
ISSN: 1027-5487
DOI: 10.11650/tjm.17.2013.3266